Quantum and classical branching flow in space and time
نویسندگان
چکیده
Branching flow, a phenomenon known for steady wave propagation in two-dimensional weakly correlated random potential, is also present the time-dependent Schr\"odinger equation single particle one dimension, moving fluctuating potential. We explore parameter space of this model using numerical simulations and identify its classical regions, where just sufficient specification, quantum region, such simplification not possible. region analytical results white noise are relevant. Qualitative behavior dynamics discussed terms branching time scale new related to particle's kinetic energy.
منابع مشابه
Quantum Space-time and Classical Gravity
A method has been recently proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example a version of quantized space-time is considered here. It is found that there is a natural differential calculus using which the space-time is necessarily flat Minkowski space-time. Perturbations of this calculus are shown to give rise to non...
متن کاملClassical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function with error δ we present a classical deterministic branching program of the same length and width at most (1 + 2/(1− 2δ)) that computes the same function. Second technique is a classical stochastic simulation technique f...
متن کاملClassical vs. Quantum Read-Once Branching Programs
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree quantum read-once branching programs of size O(n), while each classical randomized read-once branching program and each quantum OBDD for this function with bounded twosided error requires size 2.
متن کاملQuantum vs. Classical Read-Once Branching Programs
The paper presents the first nontrivial upper and lower bounds for (nonoblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the following sense: (i) A simple, explicit boolean function on 2n input bits is presented that is computable by error-free quantum read-once branching programs of...
متن کاملQuantum branching programs and space-bounded nonuniform quantum complexity
In this paper, the space complexity of nonuniform quantum computations is investigated. The model chosen for this are quantum branching programs (QBPs), which provide a graphic description of sequential quantum algorithms. In the first part of the paper, simulations between QBPs and nonuniform quantum Turing machines are presented, which allow to transfer lower and upper bound results between t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2022
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.106.052215